Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
نویسندگان
چکیده
We present a new I/O-efficient index structure for storing planar subdivisions. This so-called guard-quadtree is a compressed linear quadtree, which is provably efficient for map overlay, point location, and range queries in low-density subdivisions. In particular, we can preprocess a lowdensity subdivision with n edges, in O(sort(n)) I/Os, to build a guard-quadtree that allows us to: (i) compute the intersections between the edges of two such preprocessed subdivisions in O(scan(n)) I/Os, where n is the total number of edges in the two subdivisions; (ii) answer a single point location query in O(logB n) I/Os, and k batched point location queries in O(scan(n) + sort(k)) I/Os; and (iii) answer range queries for any constant-complexity query range Q in O( 1ε (logB n)+scan(kε)) I/Os for every ε > 0, where kε is the number of edges of the subdivision within distance ε · diam(Q) from Q. For the special case where the subdivision is a fat triangulation, we show how to obtain the same results with an ordinary (uncompressed) linear quadtree, which we call the star-quadtree. The star-quadtree is fully dynamic and needs only O(logB n) I/Os per update. Our algorithms and data structures improve on the previous best known bounds for overlaying general subdivisions, both in the number of I/Os and space usage. The constants in the asymptotic bounds are small, which makes our results applicable in practice. Moreover, our algorithms are simpler than previous approaches and almost all of them are cache-oblivious.
منابع مشابه
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(logn) for point set input and O(logn log k) time for planar straight-line graphs, using O(n+k/ logn) processors, where n measures input size and k output size.
متن کاملTriangulating the Square and Squaring the Triangle : 1 Quadtrees and Delaunay Triangulations are Equivalent
4 We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, 5 we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay 6 triangulation; the second finds the Delaunay triangulation, given a compressed quadtree. Both algorithms 7 run in deterministic linear time on a pointer machine. Our work builds ...
متن کاملChapter 2 Quadtrees - Hierarchical Grids
x What do you know? You know just what you perceive. What can you show? Nothin' of what you believe, And as you grow, each thread of life that you leave Will spin around your deeds and dictate your needs As you sell your soul and you sow your seeds, And you wound yourself and your loved one bleeds, And your habits grow, and your conscience feeds On all that you thought you should be – I never t...
متن کاملAmortized Analysis of Smooth Box Subdivisions in All Dimensions
1 Quadtrees are a well-known data structure for representing geometric data in the plane, and 2 naturally generalize to higher dimensions. A basic operation is to expand the tree by splitting 3 any given leaf. A quadtree is smooth if any two adjacent leaf boxes differ by at most one in 4 height. In this paper, we analyze quadtrees that maintain smoothness with each split operation. 5 Our main r...
متن کاملI/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
We present improved and simplified i/o-efficient algorithms for two problems on planar lowdensity subdivisions, namely map overlay and point location. More precisely, we show how to preprocess a low-density subdivision with n edges in O(sort(n)) i/o’s into a compressed linear quadtree such that one can: (i) compute the overlay of two such preprocessed subdivisions in O(scan(n)) i/o’s, where n i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 43 شماره
صفحات -
تاریخ انتشار 2010